Перевод: с английского на все языки

со всех языков на английский

Со всех языков на:
Английский
С английского на:
Русский

successor tree

Толкование Перевод

1 successor tree

мат. дерево преемников

Большой англо-русский и русско-английский словарь > successor tree
2 successor tree

Математика: дерево преемников

Универсальный англо-русский словарь > successor tree
3 successor tree

т. граф.

дерево предшествования, дерево обхода графа

English-Russian scientific dictionary > successor tree
4 tree

1) дерево, древо || засаживать деревьями

2) древовидная схема; древовидная структура

3) т. граф. дерево

4) pl дендритные образования на катоде ( при электроосаждении металлов)

tree from point — дерево из точки

tree with labeled nodes — дерево с помеченными вершинами

tree with ordered vertices — дерево с упорядоченными вершинами

to transport felled trees — трелевать заготовленный лес

- acyclic tree

- alternating tree

- arithmetical tree

- augmenting tree

- auxiliary tree

- balanced tree

- bicentral tree

- bicentroidal tree

- bichromatic tree

- bifurcating tree

- binary tree

- blossomed tree

- branch of tree

- branch tree

- broad-leaved tree

- bushy tree

- Cayley tree

- choice tree

- closed tree

- cluster tree

- code tree

- colored tree

- compact tree

- complete tree

- completely balanced tree

- computable tree

- computation tree

- concave tree

- continuous tree

- cospectral tree

- countable tree

- crop tree

- decision tree

- decomposition tree

- deduction tree

- degenerated tree

- depth-balanced tree

- derivation tree

- diagnostic tree

- directed tree

- dominator tree

- dual tree

- economy tree

- edge-rooted tree

- empty tree

- explicite tree

- extended tree

- family tree

- finite rooted directed tree

- finite tree

- finite-path tree

- flexible tree

- flowered tree

- folded tree

- formulation tree

- free tree

- full tree

- function tree

- generalized tree

- generation tree

- hierarchical tree

- homeomorphically irreducible tree

- identity tree

- implicite tree

- inference tree

- infinite tree

- inverted tree

- isometric tree

- labeled tree

- language tree

- late binding tree

- left-threaded tree

- line-rooted tree

- logical tree

- mast tree

- maximal tree

- minimal spanning tree

- minimal tree

- mission outcome tree
- mixed star tree
- monotonic tree

- m-tier tree

- multibranch tree

- multiway tree

- n-ary tree

- n-dimensional tree

- neighboring trees

- nonbinary tree

- nonisomorphic tree

- normal tree

- null tree

- number tree

- one-level tree

- optimal solution tree

- optimum tree

- ordered tree

- oriented tree

- parametric tree

- parsing tree

- partition of tree

- periodic tree

- pitch-yielding tree

- planar tree
- plane tree
- planted tree

- potential solution tree

- prefix tree

- probability tree

- production tree

- prognostic tree

- projective tree

- prolific tree

- proof tree

- pseudosemantic tree

- quotient tree

- radix tree

- random tree

- recursive tree

- reduced tree

- refutation tree

- regular tree

- relevance tree

- response tree

- right-threaded tree

- rubber tree

- search tree

- semiinfinite tree

- sequential tree

- set tree

- shallow tree

- shortest spanning tree

- shortest tree

- shortest-distance tree

- signed tree

- sink tree

- smooth tree

- solution tree

- sorting tree

- spanning tree

- spar tree

- spectrum tree

- split tree

- star tree

- strongly recursive tree

- stunted tree

- subspanning tree

- successor tree

- suppressed tree

- symmetric tree

- syntax tree

- ternary tree

- timber tree

- topological tree

- transition tree

- tree of objectives

- tree of statements

- trivalent tree

- trivial tree

- two-colored tree

- two-dimensional tree

- two-level tree

- undirected tree

- unlabeled tree

- unrooted tree

- upside down tree

- utility tree

- wayside trees

- weight-balanced trees

- weighted tree

- well-founded tree

English-Russian scientific dictionary > tree
5 дерево преемников

мат. successor tree

Большой англо-русский и русско-английский словарь > дерево преемников

См. также в других словарях:

Tree (set theory) — In set theory, a tree is a partially ordered set (poset) ( T … Wikipedia
National Christmas Tree (United States) — This article is about the Christmas Tree placed on the Ellipse near the White House. For the Christmas Tree placed inside the White House, see White House Christmas tree. For for the giant Sequoia known as the Nation s Christmas Tree , see… … Wikipedia
AA tree — In computer science, AA trees (Arne Andersson trees) are a form of balanced trees used for storing and retrieving ordereddata efficiently.Unlike red black trees, red nodes on an AA tree can only be added as a right subchild. In other words, no… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
T-tree — In computer science a T tree is a type of binary tree data structure that is used by main memory databases, such as DataBlitz, e X treme DB, MySQL Cluster, Oracle TimesTen and [http://www.kairosdbms.com Kairos] [http://www.emware.co.kr… … Wikipedia
One Tree Hill College — Location Physical: 421–451 Great South Road, Penrose, Auckland 1061, New Zealand Postal: PO Box 17471, Greenlane, Auckland 1546, New Zealand … Wikipedia
Van Emde Boas tree — A van Emde Boas tree (or van Emde Boas priority queue), also known as a vEB tree, is a tree data structure which implements an associative array with m bit integer keys. It performs all operations in O(log m ) time. Notice that m is the size of… … Wikipedia
Aronszajn tree — In set theory, an Aronszajn tree is an uncountable tree with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal kappa;, a kappa; Aronszajn tree is a tree of… … Wikipedia
Suslin tree — In mathematics, a Suslin tree is a tree of height omega;1 such that every branch and every antichain is at most countable. (An antichain is a set of elements such that any two are incomparable.)Every Suslin tree is an Aronszajn tree.The existence … Wikipedia

Словари и энциклопедии на Академике

Перевод: с английского на все языки

successor tree

См. также в других словарях:

Поделиться ссылкой на выделенное

Словари и энциклопедии на Академике

Перевод: с английского на все языки

successor tree

См. также в других словарях:

Поделиться ссылкой на выделенное

Прямая ссылка: